Type 2 computational complexity of functions on Cantor's space
نویسندگان
چکیده
منابع مشابه
Type 2 Computational Complexity of Functions on Cantor's Space
Weihrauch, K., and C. Kreitz, Type 2 computational complexity of functions on Cantor's space, Theoretical Computer Science 82 (1991) 1-18. Continuity and computability on Cantor's space C has turned out to be a very natural basis for a Type 2 theory of effectivity (TIE). In particular, the investigation of Type 2 computational complexity (e.g. complexity in analysis) requires the study of oracl...
متن کاملComputational Complexity of Higher Type Functions
The customary identification of feasible with polytime is discussed, Next, higher type functions are presented as a way of giving computational meaning to theorems. In particular, if a theorem has a "feasibly constructive" proof, the associated functions should be polytime. However examples are given to illustrate the difficulty of capturing the notion of polytime for higher type functions. Fin...
متن کاملComputational Complexity of Functions
Below is a translation from my Russian paper. I added references, unavailable to me in Moscow. Similar results have been also given in [Schnorr Stumpf 75] (see also [Lynch 75]). Earlier relevant work (classical theorems like Compression, Speed-up, etc.) was done in [Tseitin 56, Rabin 59, Hartmanis Stearns 65, Blum 67, Trakhtenbrot 67, Meyer Fischer 72]. I translated only the part with the state...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولFunctions on Groups and Computational Complexity
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90168-2